Parabolic subgroups in FC-type Artin groups
نویسندگان
چکیده
Parabolic subgroups are the building blocks of Artin groups. This paper extends previous results Cumplido, Gebhardt, Gonzales-Meneses and Wiest, known only for parabolic finite type groups, to FC-type We show that class is closed under intersection. also study an analog curve complex mapping group constructed by Cumplido et al. using subgroups. extend construction this complex, called subgroups, simplicial is, in most cases, infinite diameter conjecture it δ-hyperbolic.
منابع مشابه
Parabolic Subgroups of Artin Groups of Type Fc
The group AS is called an Artin group and relations sts . . . } {{ } ms,t terms = tst . . . } {{ } ms,t terms are called braid relations. For instance, if S = {s1, . . . , sn} with msi,sj = 3 for |i − j| = 1 and msi,sj = 2 otherwise, then the associated Artin group is the braid group. We denote by A+S the submonoid of AS generated by S. This monoid A+S has the same presentation as the group AS ...
متن کاملConvexity of parabolic subgroups in Artin groups
We prove that any standard parabolic subgroup of any Artin group is convex with respect to the standard generating set.
متن کاملRight-angled Artin Groups and Their Subgroups
These are notes for a course offered at Yale University in the spring semester of 2013.
متن کاملSurface subgroups of Coxeter and Artin groups
We prove that any Coxeter group that is not virtually free contains a surface group. In particular if the Coxeter group is word hyperbolic and not virtually free this establishes the existence of a hyperbolic surface group, and answers in the affirmative a question of Gromov in this setting. We also discuss when Artin groups contain hyperbolic surface groups. 2000 Mathematics Subject Classifica...
متن کاملSurface Subgroups of Right-Angled Artin Groups
We consider the question of which right-angled Artin groups contain closed hyperbolic surface subgroups. It is known that a right-angled Artin group A(K) has such a subgroup if its defining graph K contains an n-hole (i.e. an induced cycle of length n) with n ≥ 5. We construct another eight “forbidden” graphs and show that every graph K on ≤ 8 vertices either contains one of our examples, or co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Pure and Applied Algebra
سال: 2021
ISSN: ['1873-1376', '0022-4049']
DOI: https://doi.org/10.1016/j.jpaa.2020.106468